VLSI Design of RSA Cryptosystem Based on the Chinese Remainder Theorem
نویسندگان
چکیده
This paper presents the design and implementation of a systolic RSA cryptosystem based on a modified Montgomery’s algorithm and the Chinese Remainder Theorem (CRT) technique. The CRT technique improves the throughput rate up to 4 times in the best case. The processing unit of the systolic array has 100% utilization because of the proposed block interleaving technique for multiplication and square operations in the modular exponentiation algorithm. For 512-bit inputs, the number of clock cycles needed for a modular exponentiation is about 0.13 to 0.24 million. The critical path delay is 6.13ns using a 0.6μm CMOS technology. With a 150 MHz clock, we can achieve an encryption/decryption rate of about 328 to 578 Kb/s.
منابع مشابه
Compartmented Threshold RSA Based on the Chinese Remainder Theorem
In this paper we combine the compartmented secret sharing schemes based on the Chinese remainder theorem with the RSA scheme in order to obtain, as a novelty, a dedicated solution for compartmented threshold decryption or compartmented threshold digital signature generation. AMS Subject Classification: 94A60, 94A62, 11A07
متن کاملCrt Based Rsa Algorithm For Improving Reliability And Energy Efficiency With Kalman Filter In Wireless Sensor Networks
Broadcast authentication is a critical security service in wireless sensor networks (WSNs). However, due to resource constrained of sensor nodes, providing an authentication mechanism for broadcast message is difficult. This paper deals with the forwarding scheme for wireless sensor networks aimed at combining low computational complexity and high performance in terms of energy efficiency with ...
متن کاملMultilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem
A recent work of Harn and Fuyou presents the first multilevel (disjunctive) threshold secret sharing scheme based on the Chinese Remainder Theorem. In this work, we first show that the proposed method is not secure and also fails to work with a certain natural setting of the threshold values on compartments. We then propose a secure scheme that works for all threshold settings. In this scheme, ...
متن کاملModified RSA Algorithm with CRT & OAEP
The most active subjects in the security related communities are the necessary protection against the data thieves. This gives an importance and the value of exchanged data over the Internet or other media types. In many RSA cryptosystems, we usually select a small value for the public key e. This kind of choice can only speed up the encryption operation but do not forget that by this way, the ...
متن کاملCryptanalysis of Multi Prime RSA with Secret Key Greater than Public Key
The efficiency of decryption process of Multi prime RSA, in which the modulus contains more than two primes, can be speeded up using Chinese remainder theorem (CRT). On the other hand, to achieve the same level of security in terms integer factorization problem the length of RSA modulus must be larger than the traditional RSA case. In [9], authors studied the RSA public key cryptosystem in a sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 17 شماره
صفحات -
تاریخ انتشار 2001